Computational complexity theory

Results: 2049



#Item
271Computational complexity theory / Game theory / Theory of computation / Computational problems / Cooperative game theory / Core / NC / Optimization problem

Social Exchange Networks With Distant BargainingI Konstantinos Georgiou1 , George Karakostas2,∗, Jochen K¨onemann1 , Zuzanna Stamirowska3 Abstract Network bargaining is a natural extension of the classical, 2-player N

Add to Reading List

Source URL: www.cas.mcmaster.ca

Language: English - Date: 2013-12-01 18:51:20
272Circuit complexity / Pseudorandomness / Order theory / Computational complexity theory / Monotonic function / Pseudorandom generator / Parity function / Monotone / ACC0

On Derandomization and Average-Case Complexity of Monotone Functions ∗ George Karakostas †

Add to Reading List

Source URL: www.cas.mcmaster.ca

Language: English - Date: 2013-12-01 18:41:47
273Computational complexity theory / Theory of computation / Mathematics / Data types / Primitive types / Theoretical computer science / Analysis of algorithms / Algorithm / Boolean data type / NP / Time complexity / String

PLTL Lesson Plan Last Edited: August 19, 2015 Topic: Big-Oh Notation Activity Guidelines

Add to Reading List

Source URL: cahsi.cs.utep.edu

Language: English - Date: 2015-08-19 15:21:38
274Computational complexity theory / Theory of computation / Complexity classes / Computational resources / Structural complexity theory / Theoretical computer science / MapReduce / Time hierarchy theorem / NTIME / Time complexity / DSPACE / SL

On the Computational Complexity of MapReduce ´ am D. Lelkes1 , Lev Reyzin1 , Benjamin Fish1 , Jeremy Kun1(B) , Ad´ and Gy¨ orgy Tur´

Add to Reading List

Source URL: www.levreyzin.com

Language: English - Date: 2016-01-18 21:47:16
275Computational complexity theory / Cryptography / Theory of computation / Circuit complexity / Cryptographic protocols / Complexity classes / Quantum complexity theory / Garbled circuit / Circuit / Secure multi-party computation / NC / Boolean circuit

2015 IEEE Symposium on Security and Privacy Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs Eli Ben-Sasson§ , Alessandro Chiesa∗ , Matthew Green† , Eran Tromer¶ , Madars Virza‡ ∗ ETH

Add to Reading List

Source URL: diyhpl.us

Language: English
276Computational complexity theory / Theory of computation / Theoretical computer science / Circuit complexity / Complexity classes / Logic in computer science / Clique problem / Boolean circuit / Clique / Circuit / ACC0 / NC

LEARNING CIRCUITS AND NETWORKS BY INJECTING VALUES 1

Add to Reading List

Source URL: www.levreyzin.com

Language: English - Date: 2010-09-09 14:03:27
277Computational complexity theory / Theory of computation / Complexity classes / NP-complete problems / Mathematical optimization / NP-hard problems / MAX-3SAT / NP / Approximation algorithm / Probabilistically checkable proof / PCP theorem / APX

Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004

Add to Reading List

Source URL: vigna.di.unimi.it

Language: English - Date: 2008-02-01 14:51:28
278Operations research / Computational complexity theory / Scheduling / Mathematics / Applied mathematics / NP-hard problems / Complexity classes / Mathematical optimization / Flow shop scheduling / Makespan / Combinatorial optimization / Schedule

Special Issue on Artificial Intelligence Underpinning Golden Ball Algorithm for solving Flow Shop Scheduling Problem Fatima Sayoti, Mohammed Essaid Riffi LAROSERI Laboratory, Dept. of Computer Science, Faculty of Scienc

Add to Reading List

Source URL: www.ijimai.org

Language: English - Date: 2016-03-29 07:56:34
279Mathematics / Graph theory / Computational complexity theory / Edsger W. Dijkstra / B-tree / Shortest path problem / Big O notation / Heap

May 21, Spring 2008 Final Exam Introduction to Algorithms Massachusetts Institute of Technology

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2009-05-07 21:17:22
280Public-key cryptography / Cryptography / Computational complexity theory / Zero-knowledge proof / Proof of knowledge / IP / Digital signature / Commitment scheme / NP / Random oracle / Mathematical proof / Markov chain

Private Client-Side Profiling with Random Forests and Hidden Markov Models George Danezis1 , Markulf Kohlweiss1 , Benjamin Livshits1 , and Alfredo Rial2 1 2

Add to Reading List

Source URL: www0.cs.ucl.ac.uk

Language: English - Date: 2013-10-10 06:48:57
UPDATE